Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
enumeration procedure - translation to russian
CLASS OF COMBINATORIAL ENUMERATION PROBLEMS
Graphical enumeration; Enumeration of graphs
![free trees]] on 2, 3, and 4 labeled vertices: <math>2^{2-2}=1</math> tree with 2 vertices,
<math>3^{3-2}=3</math> trees with 3 vertices, and <math>4^{4-2}=16</math> trees with 4 vertices.](https://commons.wikimedia.org/wiki/Special:FilePath/Cayley's formula 2-4.svg?width=200 "free trees]] on 2, 3, and 4 labeled vertices: <math>2^{2-2}=1</math> tree with 2 vertices,
<math>3^{3-2}=3</math> trees with 3 vertices, and <math>4^{4-2}=16</math> trees with 4 vertices.")
enumeration procedure
математика
процедура перебора
standard procedure
SET OF STEP-BY-STEP INSTRUCTIONS COMPILED BY AN ORGANIZATION TO HELP WORKERS CARRY OUT ROUTINE OPERATIONS
Standard Operating Procedures; Standard procedures; Standard Operating Procedure; General operating procedure; General operating procedures; General Operating Procedures; General Operating Procedure; Standard operating procedures; Standing operating procedure; S.O.P.; Standard procedure
типовая процедура
enumeration of graphs
математика
перечисление графов
Definition
civil procedure
n. the complex and often confusing body of rules and regulations set out in both state (usually Code of Civil Procedure) and federal (Federal Code of Procedure) laws which establish the format under which civil lawsuits are filed, pursued and tried. Civil procedure refers only to form and procedure, and not to the substantive law which gives people the right to sue or defend a lawsuit.
See also: civil civil action civil code civil law
Wikipedia
Graph enumeration
In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph. These problems may be solved either exactly (as an algebraic enumeration problem) or asymptotically. The pioneers in this area of mathematics were George Pólya, Arthur Cayley and J. Howard Redfield.
